#include<iostream>
#include<vector>

using namespace std;

bool hasIncreasingSubarrays(vector<int>& nums, int k) {
    int res = 0, pre_cnt = 0, cnt = 0;
    for (int i = 0; i < nums.size(); i++)
    {
        cnt++;
        if (i == nums.size() - 1 || nums[i] >= nums[i + 1])
        {
            res = max({ res,cnt / 2,min(pre_cnt,cnt) });
            pre_cnt = cnt;
            cnt = 0;
        }
    }
    return res >= k;
}